Capacity Bounds for Dirty Paper with Exponential Dirt

نویسندگان

  • Mostafa Monemizadeh
  • Saeed Hajizadeh
  • Ghosheh Abed Hodtani
  • Seyed Alireza Seyedin
چکیده

The additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is studied. This channel can be considered as an exponential version of the discrete memoryless channel with state known non-causally at the encoder considered by Gelfand and Pinsker. We make use of Gelf’and-Pinsker’s classic capacity Theorem to derive inner and outer bounds on the capacity of this channel under a non-negative input constraint as well as a constraint on the mean value of the input. First we obtain an outer bound for AENC-AEI. Then by using the input distribution achieving the outer bound, we derive an inner bound which this inner bound coincides with the obtained outer bound at high signal to noise ratios (SNRs) and therefore, gives the capacity of the AENC-AEI at high SNRs. Keywords-Additive exponential noise; capacity bounds; dirty paper; side information

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference

Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios‎. First, it is shown that the additive Gaussian ch...

متن کامل

On Capacity of the Writing onto Fast Fading Dirt Channel

The classic Costa’s “writing on dirty paper” capacity result establishes that full state pre-cancellation can be attained in the Gel’fand-Pinsker channel with additive state and additive Gaussian noise. This result holds under the assumption that perfect channel knowledge is available at both transmitter and receiver: such an assumption is not valid in wireless scenarios affected by fading and ...

متن کامل

On " Dirty-paper Coding "

regardless of what Q is. The title of Costa’s work came by making an analogy to the problem of writing on dirty paper, where the reader cannot nominally distinguish dirt from ink. There are many scenarios where this result may be applied. In the field of information hiding (or watermarking), a message is encoded in u, which is to be embedded in the host waveform i using the signal s. Data compr...

متن کامل

Multi-agent Cooperative Cleaning of Expanding Domains

Several recent works considered multi-a(ge)nt robotics in static environments. In this work we examine ways of operating in dynamic environments, where changes take place independently of the agents’ activity. The work focuses on a dynamic variant of the cooperative cleaners problem, a problem that requires several simple agents to clean a connected region of “dirty” pixels in Z. A number of si...

متن کامل

A Practical Dirty Paper Coding Applicable for Broadcast Channel

In this paper, we present a practical dirty paper coding scheme using trellis coded modulation for the dirty paper channel Y = X+S+W, E{X} ≤ P , where W is white Gaussian noise with power σ w, P is the average transmit power and S is the Gaussian interference with power σ s that is non-causally known at the transmitter. We ensure that the dirt in our scheme remains distinguishable to the receiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1212.3690  شماره 

صفحات  -

تاریخ انتشار 2012